#include <bits/stdc++.h>

using namespace std;

class Solution
{
public:
    int maxUncrossedLines(vector<int> &nums1, vector<int> &nums2)
    {
        vector<vector<int>> dp(nums1.size() + 1, vector<int>(nums2.size() + 1, 0));
        int length1 = nums1.size();
        int length2 = nums2.size();
        for (int i = 1; i < length1 + 1; i++)
        {
            for (int j = 1; j < length2 + 1; j++)
            {
                if (nums1[i-1] == nums2[j-1])
                {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }
                else
                {
                    dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        return dp[length1][length2];
    }
};

int main()
{
    vector<int> nums1{1, 4, 2};
    vector<int> nums2{1, 2, 4};
    Solution sol;
    cout << sol.maxUncrossedLines(nums1, nums2) << endl;
    return 0;
}